2-Visibility Drawings of Planar Graphs
نویسندگان
چکیده
In a 2-visibility drawing the vertices of a given graph are represented by rectangular boxes and the adjacency relations are expressed by horizontal and vertical lines drawn between the boxes. In this paper we want to emphasize this model as a practical alternative to other representations of graphs, and to demonstrate the quality of the produced drawings. We give several approaches, heuristics as well as provably good algorithms, to represent planar graphs within this model. To this, we present a polynomial time algorithm to compute a bend-minimum orthogonal drawing under the restriction that the number of bends at each edge is at most 1.
منابع مشابه
Bar 1-Visibility Drawings of 1-Planar Graphs
A bar 1-visibility drawing of a graph G is a drawing of G where each vertex is drawn as a horizontal line segment called a bar, each edge is drawn as a vertical line segment where the vertical line segment representing an edge must connect the horizontal line segments representing the end vertices and a vertical line segment corresponding to an edge intersects at most one bar which is not an en...
متن کاملVisibility Drawings of Plane 3-Trees with Minimum Area
A visibility drawing of a plane graph G is a drawing of G where each vertex is drawn as a horizontal line segment and each edge is drawn as a vertical line segment such that the line segments use only grid points as their endpoints. The area of a visibility drawing is the area of the smallest rectangle on the grid which encloses the drawing. A minimum-area visibility drawing of a plane graph G ...
متن کاملRectangle and Square Representations of Planar Graphs
In the first part of this survey we consider planar graphs that can be represented by a dissections of a rectangle into rectangles. In rectangular drawings the corners of the rectangles represent the vertices. The graph obtained by taking the rectangles as vertices and contacts as edges is the rectangular dual. In visibility graphs and segment contact graphs the vertices correspond to horizonta...
متن کاملParallel Transitive Closure and Point Location in Planar Structures
Parallel algorithms for several graph and geometric problems are presented, including transitive closure and topological sorting in planar st-graphs, preprocessing planar subdivisions for point location queries, and construction of visibility representations and drawings of planar graphs. Most of these algorithms achieve optimal O(logn) running time using n= logn processors in the EREW PRAM mod...
متن کاملOrthogonal drawings based on the stratification of planar graphs
We propose a linear time algorithm that associates with any planar graph G a strati!cation having a particular layered spanning tree of G. Using this strati!cation, an algorithm to obtain a 2-visibility drawing of G is described. c © 2003 Elsevier B.V. All rights reserved.
متن کامل